The generator matrix

 1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1
 0 X^2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 X^2 X^2 X^2 X^2 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2 X^2  0 X^2 X^2  0 X^2 X^2  0 X^2 X^2 X^2  0 X^2  0 X^2 X^2 X^2 X^2 X^2 X^2
 0  0 X^2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 X^2 X^2 X^2 X^2 X^2 X^2 X^2  0  0  0  0  0  0  0 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2  0  0 X^2 X^2 X^2 X^2 X^2 X^2 X^2 X^2 X^2  0 X^2 X^2 X^2 X^2 X^2 X^2  0  0  0
 0  0  0 X^2  0  0  0  0  0  0  0 X^2 X^2 X^2 X^2 X^2 X^2 X^2 X^2 X^2  0 X^2 X^2  0  0 X^2 X^2  0 X^2 X^2  0  0 X^2  0  0 X^2 X^2  0  0 X^2 X^2  0  0  0  0  0  0 X^2  0 X^2 X^2  0  0 X^2 X^2 X^2 X^2  0 X^2 X^2 X^2 X^2  0  0
 0  0  0  0 X^2  0  0  0 X^2 X^2 X^2 X^2 X^2  0 X^2 X^2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2  0 X^2 X^2 X^2 X^2 X^2  0  0 X^2 X^2 X^2
 0  0  0  0  0 X^2  0 X^2 X^2 X^2  0  0  0  0 X^2 X^2 X^2 X^2  0  0  0 X^2 X^2 X^2 X^2  0  0  0 X^2 X^2 X^2 X^2 X^2  0 X^2 X^2 X^2  0 X^2 X^2  0 X^2  0  0  0  0 X^2  0 X^2 X^2 X^2 X^2  0  0  0  0  0  0 X^2 X^2  0  0 X^2 X^2
 0  0  0  0  0  0 X^2 X^2  0 X^2 X^2  0 X^2 X^2 X^2  0  0 X^2  0 X^2 X^2 X^2  0  0 X^2  0 X^2 X^2 X^2  0  0 X^2  0  0  0  0 X^2 X^2 X^2 X^2 X^2 X^2 X^2  0 X^2  0  0  0 X^2 X^2  0  0  0  0 X^2  0 X^2 X^2  0 X^2 X^2  0 X^2  0

generates a code of length 64 over Z2[X]/(X^3) who´s minimum homogenous weight is 64.

Homogenous weight enumerator: w(x)=1x^0+510x^64+1x^128

The gray image is a linear code over GF(2) with n=256, k=9 and d=128.
As d=128 is an upper bound for linear (256,9,2)-codes, this code is optimal over Z2[X]/(X^3) for dimension 9.
This code was found by Heurico 1.16 in 0.136 seconds.